A Reduct Solving Parallel Algorithm Based on Relational Extension Matrix
نویسندگان
چکیده
In this paper, on the basis of studying the limitations of the basic rough set model, we present Tolerance Information Systems, which is based on a family set of tolerance relations between objects when given a set of tolerance relations. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect of approximation classification. Based on this model, we propose two algorithms that will give us one near-optimal attributes reduct in memory and process efficient way, the first one is a single processor algorithm which uses concepts from relation and extension matrices. Based on the first algorithm, its parallel processor version is proposed, the parallel version is far more efficient.
منابع مشابه
A Parallel Reduct Algorithm Based On Extension Matrix
In this paper, on the basis of studying the limitations of the basic rough set model, we present a general rough set model, which is based on a family set of tolerance relations which is based on a family set of tolerance relations instead of equivalence relations between objects. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect ...
متن کاملUsing finite difference method for solving linear two-point fuzzy boundary value problems based on extension principle
In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...
متن کاملDiscernibility matrix simplification for constructing attribute reducts
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works in a similar way to the classical Gaussian elimination method for solving a system of linear equations. Elementary matrix simplification operations are introduced. Each operation transforms a matrix into a simpler form. By applying these operations a finite number of times, one can t...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملFault Detection of Bearings Using a Rule-based Classifier Ensemble and Genetic Algorithm
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works with genetic algorithm. To identify potential problems and prevent complete failure of bearings, a new method based on rule-based classifier ensemble is presented. Genetic algorithm is used for feature reduction. The generated rules of the reducts are used to build the candidate base...
متن کامل